Subclass Graph Embedding and a Marginal Fisher Analysis paradigm

نویسندگان

  • Anastasios Maronidis
  • Anastasios Tefas
  • Ioannis Pitas
چکیده

Subspace learning techniques have been extensively used for dimensionality reduction (DR) in many pattern classification problem domains. Recently, methods like Subclass Discriminant Analysis (SDA) and Clusteringbased Discriminant Analysis (CDA), which use subclass information for the discrimination between the data classes, have attracted much attention. In parallel, important work has been accomplished on Graph Embedding (GE), which is a general framework unifying several subspace learning techniques. In this paper, GE has been extended in order to integrate subclass discriminant information resulting to the novel Subclass Graph Embedding (SGE) framework, which is the main contribution of our work. It is proven that SGE encapsulates a diversity of both supervised and unsupervised unimodal methods like Locality Preserving Projections (LPP), Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA). The theoretical link of SDA and CDA methods with SGE is also established. Along these lines, it is shown that SGE comprises a generalization of the typical GE framework including subclass DR methods. Moreover, it allows for an easy utilization of kernels for confronting non-linearly separable data. Employing SGE, in this paper a novel DR algorithm, which uses subclass discriminant information, called Subclass Marginal Fisher Analysis (SMFA) has been proposed. Through a series of experiments on various real-world datasets, it is shown that SMFA outperforms in most of the cases the state-of-the-art demonstrating the efficacy and power of SGE as a platform to develop new methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detecting Overlapping Communities in Social Networks using Deep Learning

In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...

متن کامل

Marginal Discriminant Projection for Coal Mine Safety Data Dimensionality Reduction

Marginal Fisher Analysis (MFA) is a novel dimensionality reduction algorithm. However, the two nearest neighborhood parameters are difficult to select when constructing graphs. In this paper, we propose a nonparametric method called Marginal Discriminant Projection (MDP) which can solves the problem of parameters selection in MFA. Experiment on several benchmark datasets demonstrated the effect...

متن کامل

Marginal conditional independence models with application to graphical modeling

Conditional independence models are defined by a set of conditional independence restrictions and play an important role in many statistical applications, especially, but not only, graphical modeling. In this paper we identify a subclass of these models which are hierarchical marginal log-linear, as defined by Bergsma and Rudas (2002a). Such models are smooth, which implies the applicability of...

متن کامل

Multivariate extended skew - t distributions and related families

A class of multivariate extended skew-t (E ST ) distributions is introduced and studied in detail, along with closely related families such as the subclass of extended skew-normal distributions. Besides mathematical tractability and modeling flexibility in terms of both skewness and heavier tails than the normal distribution, the most relevant properties of the E ST distribution include closure...

متن کامل

On the Hardness of Point-Set Embeddability⋆

A point-set embedding of a plane graph G with n vertices on a set S of n points is a straight-line drawing of G, where the vertices of G are mapped to distinct points of S. The problem of deciding whether a plane graph admits a point-set embedding on a given set of points is NPcomplete for 2-connected planar graphs, but polynomial-time solvable for outerplanar graphs and plane 3-trees. In this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pattern Recognition

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2015